相对论重离子碰撞实验中混合事件方法的研究

把RQMD(Relativistic Quantum Molecular Dynamics)产生器产生的数据输入作为原始事例取样,讨论了在比较复杂的背景情况下,一种新的混合事件方法,用以证实在相对论重离子碰撞实验中高能量激发共振态的存在.并以共振态重子Δ⁺⁺为例演示了这一方法的应用.     

半导体带电粒子探测器的研制及其在空间物理中的应用

阐述了空间辐射环境监测的意义,描述了半导体带电粒子探测器的研制及由其组成的望远镜系统在空间物理中的应用,并给出了用此探测器在卫星上进行地球辐射环境监测、太阳质子事件和地磁暴探测的部分结果.     

事件空间中二阶非Четаев型非完整系统的守恒律

研究事件空间中二阶非чeTaeB型非完整系统的守恒律。提出事件空间中的Jourdain原理，引入事件空间中的Jorudain生成元，给出无限小变换下的Jourdain原理的不变性条件。在一定条件下得到事件空间中系统的守恒律。并举例说明结果的应用。     

模糊事件贝叶斯公式

讨论了模糊事件的概率及其基本性质 ,并通过对经典贝叶斯公式的推广 ,提出了模糊事件的贝叶斯公式 .     

Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error

Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.      

Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing

We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times.     

Sample-path optimization of convex stochastic performance functions

In this paper we propose a method for optimizing convex performance functions in stochastic systems. These functions can include expected performance in static systems and steady-state performance in discrete-event dynamic systems; they may be nonsmooth. The method is closely related to retrospective simulation optimization; it appears to overcome some limitations of stochastic approximation, which is often applied to such problems. We explain the method and give computational results for two classes of problems: tandem production lines with up to 50 machines, and stochastic PERT (Program Evaluation and Review Technique) problems with up to 70 nodes and 110 arcs. Sponsored by the National Science Foundation under grant number CCR-9109345, by the Air Force Systems Command, USAF, under grant numbers F49620-93-1-0068 and F49620-95-1-0222, by the U.S. Army Research Office under grant number DAAL03-92-G-0408, and by the U.S. Army Space and Strategic Defense Command under contract number DASG60-91-C-0144. The U.S. Government has certain rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. Sponsored by a Wisconsin/Hilldale Research Award, by the U.S. Army Space and Strategic Defense Command under contract number DASG60-91-C-0144, and the Air Force Systems Command, USAF, under grant number F49620-93-1-0068. Sponsored by the National Science Foundation under grant number DDM-9201813.     

Excess molar heat capacities of ((<Emphasis Type="Italic">R</Emphasis>)-(+)-α-pinene+(<Emphasis Type="Italic">S</Emphasis>)-(-)- α-pinene) at temperatures between 293.15-308.15 K

Summary {\rtf1\ansi\ansicpg1250\deff0\deflang1038\deflangfe1038\deftab708{\fonttbl{\f0\froman\fprq2\fcharset238{\*\fname Times New Roman;}Times New Roman CE;}} \viewkind4\uc1\pard\f0\fs20 New explanations are given for two types of irregular thermogravimetric (TG) data. A TG relationship between mass and temperature is derived on the basis of migration behavior of bubbles generated in bulk of sample system, and superposed on that derived on the basis of kinetics of the 4\super th\nosupersub order event, which is superposed on the experimental TG data obtained from three reference papers. This suggests that these TG data are reflecting migration of bubbles. A dependence of TG behavior on heating rate, which is contrary to usual that, is shown and is explained in terms of event-rate determination by boiling. \par }     

Massively time-parallel,approximate simulation of loss queueing systems

A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large.     

An exclusive event generator for e~+ e~- scan experiments

An exclusive event generator is designed for e+e-scan experiments,including initial state radiation effects up to the second order correction.The generator is coded within the framework of BesEvtGen.There are seventy hadronic decay modes available,with effective center-of-mass energy coverage from the two pion mass threshold up to about 6 GeV.The accuracy achieved for the initial state radiation correction reaches the level achieved by the KKMC generator.The uncertainty associated with the calculation of the correction factor to the initial state radiation is dominated by the measurements of the energy-dependent Born cross section.